On GMW Designs and a Conjecture of Assmus and Key

Designs and Codes: An update

Since the publication in 1992 of “Designs and their Codes” significant progress has been made in the general area of codes coming from designs. This article reviews this progress and presents some of the results — including confirmation of certain conjectures made and answers to some of the questions raised in the book.

Hermitian unitals are code words

We show that a unital in PG(2, q) is Hermitian if and only if it is in the code generated by the lines of PG(2, q). This implies the truth of a conjecture made by Assmus and Key.

On the Theory of Designs

Abstracts for talks to be presented in the CCCS 98 Workshop Instructional

s for talks to be presented in the CCCS 98 Workshop Instructional Lectures Cryptography and Combinatorial Designs Charles J. Colbourn, Dorothean Professor of Computer Science University of Vermont In this series of five lectures, we explore some of the many problems in cryptography where combinatorial designs have played a substantial role. To set the stage, we review some ideas from classical ...

A Deterministic Multiple Key Space Scheme for Wireless Sensor Networks via Combinatorial Designs

The establishing of a pairwise key between two nodes for encryption in a wireless sensor network is a challenging issue. To do this, we propose a new deterministic key pre-distribution scheme which has modified the multiple key space scheme (MKSS). In the MKSS, the authors define two random parameters to make better resilience than existing schemes. Instead of a random selection of these parame...